A single-source shortest path algorithm for dynamic graphs
نویسندگان
چکیده
منابع مشابه
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm
In spite of intensive research, little progress has been made towards fast and work-eecient parallel algorithms for the single source shortest path problem. Our-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, improves this situation at least in the following \average-case" sense: For random directed graphs with edge probability d n and uniformly distribu...
متن کامل-stepping : a Parallel Single Source Shortest Path Algorithm
In spite of intensive research, little progress has been made towards fast and work-eecient parallel algorithms for the single source shortest path problem. Our-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, improves this situation at least in the following \average-case" sense: For random directed graphs with edge probability d n and uniformly distribu...
متن کاملBatch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully-dynamic batch algorithms for single-source shortest paths in directed graphs with positive edge weights. We give an extensive experimental study of the existing algorithms for the single-edge and the batch case, incl...
متن کاملShortest Path Computations in Source-Deplanarized Graphs
We consider a class of non-planar graphs that arises in VLSI layout compaction and show that a numuer of shortest path problems on these graphs can be solved in the same time as the corresponding problem in a planar graph.
متن کاملDeterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs
In this paper we consider the decremental single-source shortest paths (SSSP) problem, where given a graph G and a source node s the goal is to maintain shortest distances between s and all other nodes in G under a sequence of online adversarial edge deletions. In their seminal work, Even and Shiloach [JACM 1981] presented an exact solution to the problem in unweighted graphs with only O(mn) to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2020
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2020.01.002